Ternary tree

Results: 57



#Item
41Managing recursive, tree-like data structures with Firebird Frank Ingermann  Welcome to this session !

Managing recursive, tree-like data structures with Firebird Frank Ingermann Welcome to this session !

Add to Reading List

Source URL: www.firebirdsql.org

Language: English - Date: 2011-12-29 15:42:21
42Prefix Reversals on Binary and Ternary Strings Cor Hurkens1 , Leo van Iersel1 , Judith Keijsper1 , Steven Kelk2 , Leen Stougie1,2 , and John Tromp2 1  Technische Universiteit Eindhoven (TU/e), Den Dolech 2,

Prefix Reversals on Binary and Ternary Strings Cor Hurkens1 , Leo van Iersel1 , Judith Keijsper1 , Steven Kelk2 , Leen Stougie1,2 , and John Tromp2 1 Technische Universiteit Eindhoven (TU/e), Den Dolech 2,

Add to Reading List

Source URL: homepages.cwi.nl

Language: English - Date: 2008-01-17 14:40:10
43BINARY SUBTREES WITH FEW LABELED PATHS RODNEY G. DOWNEY, NOAM GREENBERG, CARL G. JOCKUSCH, JR., AND KEVIN G. MILANS Abstract. We prove several quantitative Ramseyan results involving ternary complete trees with {0, 1}-la

BINARY SUBTREES WITH FEW LABELED PATHS RODNEY G. DOWNEY, NOAM GREENBERG, CARL G. JOCKUSCH, JR., AND KEVIN G. MILANS Abstract. We prove several quantitative Ramseyan results involving ternary complete trees with {0, 1}-la

Add to Reading List

Source URL: www.math.uiuc.edu

Language: English - Date: 2011-07-08 08:35:11
44RESEARCHCONTRJBUTJONS  Programming Techniques and Data Structures ]ohn Bruno

RESEARCHCONTRJBUTJONS Programming Techniques and Data Structures ]ohn Bruno

Add to Reading List

Source URL: web.eecs.umich.edu

Language: English - Date: 2004-02-06 12:39:07
45Fast Algorithms for Sorting and Searching Strings Jon L. Bentley* Abstract We present theoretical algorithms for sorting and searching multikey data, and derive from them practical C

Fast Algorithms for Sorting and Searching Strings Jon L. Bentley* Abstract We present theoretical algorithms for sorting and searching multikey data, and derive from them practical C

Add to Reading List

Source URL: www.cs.princeton.edu

Language: English - Date: 1996-10-24 21:25:42
46Binary Tree Properties & Representation  Minimum Number Of Nodes

Binary Tree Properties & Representation Minimum Number Of Nodes

Add to Reading List

Source URL: www.cise.ufl.edu

Language: English - Date: 2013-01-30 22:50:39
47(2,4) TREES • Search Trees (but not binary) • also known as 2-4, 2-3-4 trees

(2,4) TREES • Search Trees (but not binary) • also known as 2-4, 2-3-4 trees

Add to Reading List

Source URL: www.cs.purdue.edu

Language: English - Date: 2001-01-03 12:06:30
48R-TREES. A DYNAMIC INDEX STRUCTURE FOR SPATIAL SEARCHING Antomn Guttman

R-TREES. A DYNAMIC INDEX STRUCTURE FOR SPATIAL SEARCHING Antomn Guttman

Add to Reading List

Source URL: www.sai.msu.su

Language: English - Date: 2003-03-31 10:28:50
49Numerische Mathematlk l, 269- 27I (l[removed]A Note on Two Problemsin Connexionwith Graphs

Numerische Mathematlk l, 269- 27I (l[removed]A Note on Two Problemsin Connexionwith Graphs

Add to Reading List

Source URL: www-m3.ma.tum.de

Language: English - Date: 2008-01-25 09:55:40
50R-TREES. A DYNAMIC INDEX STRUCTURE FOR SPATIAL SEARCHING Antomn Guttman

R-TREES. A DYNAMIC INDEX STRUCTURE FOR SPATIAL SEARCHING Antomn Guttman

Add to Reading List

Source URL: www-db.deis.unibo.it

Language: English - Date: 2008-12-02 06:41:47